Speeding-up verification of digital signatures

In 2003, Fischlin introduced the concept of progressive verification in cryptography to relate error probability a cryptographic procedure its running time. It ensures that verifier confidence validity grows with work it invests computation. Le, Kelkar and Kate recently revisited this approach for digital signatures proposed similar framework under name flexible signatures. We propose efficient probabilistic procedures popular signature schemes which decreases exponentially theoretical RSA ECDSA based on some elegant idea by Bernstein 2000 additional tricks. also present general practical method, makes use error-correcting codes, involves matrix/vector multiplication.